Visualization techniques for categorical analysis of social networks with multiple edge sets
نویسندگان
چکیده
The growing popularity and diversity of social network applications present new opportunities as well as new challenges. The resulting social networks have high value to business intelligence, sociological studies, organizational studies, epidemical studies, etc. The ability to explore and extract information of interest from the networks is thus crucial. However, these networks are often large and composed of multi-categorical nodes and edges, making it difficult to visualize and reason with conventional methods. In this paper, we show how to combine statistical methods with visualization to address these challenges, and how to arrange layouts differently to better bring out different aspects of the networks. We applied our methods to several social networks to demonstrate their effectiveness in characterizing the networks and clarifying the structures of interest, leading to new findings.
منابع مشابه
Social Network Clustering and Visualization using Hierarchical Edge Bundles
The hierarchical edge bundle (HEB) method generates useful visualizations of dense graphs, such as social networks, but requires a predefined clustering hierarchy, and does not easily benefit from existing straight-line visualization improvements. This paper proposes a new clustering approach that extracts the community structure of a network and organizes it into a hierarchy that is flatter th...
متن کاملGuest Editorial: InfoVis 2005
THREE papers in this issue of IEEE Transactions on Visualization and Computer Graphics (TVCG) are expanded versions of ones presented at InfoVis 2005. These examples of the cutting edge of information visualization research showcase the diversity and depth of the field, illustrating new display techniques as well as novel application domains for information visualization systems. The three pape...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملMerging Similarity and Trust Based Social Networks to Enhance the Accuracy of Trust-Aware Recommender Systems
In recent years, collaborative filtering (CF) methods are important and widely accepted techniques are available for recommender systems. One of these techniques is user based that produces useful recommendations based on the similarity by the ratings of likeminded users. However, these systems suffer from several inherent shortcomings such as data sparsity and cold start problems. With the dev...
متن کاملDesign and Test of the Real-time Text mining dashboard for Twitter
One of today's major research trends in the field of information systems is the discovery of implicit knowledge hidden in dataset that is currently being produced at high speed, large volumes and with a wide variety of formats. Data with such features is called big data. Extracting, processing, and visualizing the huge amount of data, today has become one of the concerns of data science scholar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Networks
دوره 37 شماره
صفحات -
تاریخ انتشار 2014